Lower bounds to error probability for coding on discrete memoryless channels. II
نویسندگان
چکیده
منابع مشابه
A new lower bound on the maximal error probability for discrete memoryless multiple-access channels
In this work, a new lower bound for the maximal error probability of a two-user discrete memoryless (DM) multiple-access channel (MAC) is derived. This is the first bound of this type that explicitly imposes independence of the users’ input distributions (conditioned on the time-sharing auxiliary variable) and thus results in a tighter sphere-packing exponent when compared to the tightest known...
متن کاملExponential error bounds on parameter modulation-estimation for discrete memoryless channels
We consider the problem of modulation and estimation of a random parameter U to be conveyed across a discrete memoryless channel. Upper and lower bounds are derived for the best achievable exponential decay rate of a general moment of the estimation error, E|Û−U |ρ, ρ ≥ 0, when both the modulator and the estimator are subjected to optimization. These exponential error bounds turn out to be inti...
متن کاملLower Bounds on the Quantum Capacity and Error Exponent of General Memoryless Channels
Tradeoffs between the information rate and fidelity of quantum error-correcting codes are discussed. Quantum channels to be considered are those subject to independent errors and modeled as tensor products of copies of a general completely positive linear map, where the dimension of the underlying Hilbert space is a prime number. On such a quantum channel, the highest fidelity of a quantum erro...
متن کاملLower bounds on the quantum capacity and highest error exponent of general memoryless channels
Tradeoffs between the information rate and fidelity of quantum error-correcting codes are discussed. Quantum channels to be considered are those subject to independent errors and modeled as tensor products of copies of a general completely positive linear map, where the dimension of the underlying Hilbert space is a prime number. On such a quantum channel, the highest fidelity of a quantum erro...
متن کاملCoding and decoding for time-discrete amplitude-continuous memoryless channels
In this report we consider some aspects of the general problem of encoding and decoding for time-discrete, amplitude-continuous memoryless channels. The results can be summarized under three main headings. 1. Signal Space Structure: A scheme for constructing a discrete signal space, for which sequential encoding-decoding methods are possible for the general continuous memoryless channel, is des...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1967
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(67)91200-4